Tree Adjunction as Minimalist Lowering
نویسنده
چکیده
Even though Minimalist grammars are more powerful than TAG on the string level, the classes of tree languages the two define are incomparable. I give a constructive proof that if the standard Move operation in Minimalist grammars is replaced by Reset Lowering, every TAG tree language can be generated. The opposite does not hold, so the strong generative capacity of Minimalist grammars with Reset Lowering exceeds that of TAG.
منابع مشابه
Movement-Generalized Minimalist Grammars
A general framework is presented that allows for Minimalist grammars to use arbitrary movement operations under the proviso that they are all definable by monadic second-order formulas over derivation trees. Lowering, sidewards movement, and clustering, among others, are the result of instantiating the parameters of this framework in a certain way. Even though weak generative capacity is not in...
متن کاملModels of Adjunction in Minimalist Grammars
Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational level. Weak generative capacity is not affected, and while subregular complexity varies bet...
متن کاملDisentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power
In this paper we investigate the weak generative capacity of minimalist grammars with late adjunction. We show that by viewing the Specifier Island Condition as the union of three separate constraints, we obtain a more nuanced perspective on previous results on constraint interaction in minimalist grammars, as well as the beginning of a map of the interaction between late adjunction and movemen...
متن کاملA Note on Countercyclicity and Minimalist Grammars
Minimalist grammars (MGs), as introduced in Stabler (1997), have proven a useful instrument in the formal analysis of syntactic theories developed within the minimalist branch of the principles–and–parameters framework (cf. Chomsky 1995, 2000). In fact, as shown in Michaelis (2001), MGs belong to the class of mildly context–sensitive grammars. Interestingly, without there being a rise in (at le...
متن کاملThe Timing of Adjunction
This paper proposes a combinatory algorithm of structure building within the bare phrase structure theory of the Minimalist program, which assumes operation Merge as the basic structure building device. The proposed algorithm enforces a particular timing of application of 'substitution' Merge and 'adjunction' Merge. In particular, I argue that XP adjuncts are Merged 'postcyclically' in overt sy...
متن کامل